Problem of time - PDFSEARCH.IO - Document Search Engine

Problem of time
Results: 679

#	Item
661	On the possibility of faster SAT algorithms Mihai Pˇatra¸scu∗ AT&T Labs Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2009-11-12 23:47:30 NP-complete problems Logic in computer science Exponential time hypothesis 2-satisfiability Boolean satisfiability problem Conjunctive normal form Time complexity Parameterized complexity Dominating set Theoretical computer science Computational complexity theory Applied mathematics
662	A Survey of 3sum-Hard Problems James King [removed] Add to Reading List Source URL: www.cs.mcgill.ca Language: English - Date: 2004-12-20 06:07:32 3SUM Computational geometry NP-complete problems Analysis of algorithms Time complexity Reduction Algorithm Boolean satisfiability problem Complexity class Theoretical computer science Applied mathematics Computational complexity theory
663	Time and Causality William Wharton Physics Department Add to Reading List Source URL: www.fqxi.org Language: English - Date: 2009-04-15 15:57:41 Causality Philosophy of science Philosophy of physics Indeterminism Spacetime Introduction to quantum mechanics Measurement problem Retrocausality Hidden variable theory Physics Quantum mechanics Quantum measurement
664	CATS 2002 Preliminary Version Efficient Algorithms for the Maximum Add to Reading List Source URL: www.cosc.canterbury.ac.nz Language: English - Date: 2003-02-10 18:47:35 Numerical linear algebra Dynamic programming Analysis of algorithms Computational complexity theory Matrix theory Maximum subarray problem Matrix Time complexity Shortest path problem Mathematics Theoretical computer science Algebra
665	On Smale’s 17th Problem: A Probabilistic Positive Solution. Carlos Beltr´an Add to Reading List Source URL: personales.unican.es Language: English - Date: 2011-06-09 07:23:01 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Time complexity Polynomial IP Universal property PP Dirac delta function Theoretical computer science Computational complexity theory Applied mathematics
666	ERA: Efficient Serial and Parallel Suffix Tree Construction for Very Long Strings Essam Mansour1 Add to Reading List Source URL: www.vldb.org Language: English - Date: 2011-09-28 10:12:24 Dynamic programming Suffix tree Analysis of algorithms Suffix array Longest common substring problem Algorithm Trie String searching algorithm Time complexity Theoretical computer science Mathematics String
667	Book Review The Curious Incident of the Dog Add to Reading List Source URL: www.ams.org Language: English - Date: 2006-02-08 14:09:13 The Curious Incident of the Dog in the Night-Time Mathematician Mark Haddon Mathematical beauty Monty Hall problem Mathematics Richard Borcherds Philosophy of mathematics
668	By Peter Kugel IT’S TIME TO Add to Reading List Source URL: www.cs.bc.edu Language: English - Date: 2005-11-28 20:51:51 Theory of computation Computability theory Algorithms Models of computation Super-recursive algorithm Algorithm Turing machine Halting problem Computability Theoretical computer science Computer science Mathematics
669	PDF Document Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2007-09-11 19:54:54 Analysis of algorithms NP-complete problems Set cover problem Greedy algorithm Time complexity Algorithm Randomized algorithm Theoretical computer science Mathematics Computational complexity theory
670	PDF Document Add to Reading List Source URL: www.stevens.edu Language: English - Date: 2007-04-23 23:09:00 Computability theory Analysis of algorithms Theory of computation Complexity classes Generic-case complexity Halting problem Time complexity Algorithm Randomized algorithm Theoretical computer science Applied mathematics Computational complexity theory

UPDATE